Improved Mixed Integer Linear Programing Formulations for Roman Domination Problem
نویسندگان
چکیده
The Roman domination problem is considered. An improvement of two existing Integer Linear Programing (ILP) formulations is proposed and a comparison between the old and new ones is given. Correctness proofs show that improved linear programing formulations are equivalent to the existing ones regardless of the variables relaxation and usage of lesser number of constraints.
منابع مشابه
Developing a Mixed Integer Quadratic Programing Model with Integer Numbers for Designing a Dynamic closed-loop Logistics Network
Logistics Network Design includes network configuration decisions having long-standing influences on other tactical and operational decisions. Recently, regarding environmental issues and customer awareness and global warming closed-loop supply chain network design is taken into consideration. The proposed network for the integrated forward and reverse logistics is developed by formulating a cy...
متن کاملFractional Roman Domination
A function f : V (G) → {0, 1, 2} is a Roman dominating function if for every vertex with f(v) = 0, there exists a vertex w ∈ N(v) with f(w) = 2. We introduce two fractional Roman domination parameters, γR ◦ f and γRf , from relaxations of two equivalent integer programming formulations of Roman domination (the former using open neighborhoods and the later using closed neighborhoods in the Roman...
متن کاملOptimization of Mixed-Integer Non-Linear Electricity Generation Expansion Planning Problem Based on Newly Improved Gravitational Search Algorithm
Electricity demand is forecasted to double in 2035, and it is vital to address the economicsof electrical energy generation for planning purposes. This study aims to examine the applicability ofGravitational Search Algorithm (GSA) and the newly improved GSA (IGSA) for optimization of themixed-integer non-linear electricity generation expansion planning (GEP) problem. The performanceindex of GEP...
متن کاملSolving Single Machine Sequencing to Minimize Maximum Lateness Problem Using Mixed Integer Programming
Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...
متن کاملPolyhedral studies in Domination Graph Theory (I)
This paper discusses polyhedral approaches to problems in Domination Graph Thoery. We give various linear integer programming formulations for the weighted and unweighted versions of the minimum dominating set problem. We study the associated polytopes and determine dimension of the polytopes, facets, valid inequalities et al. Ideas from integer programming such as lift and project are used to ...
متن کامل